Similarity-based Clustering versus Galois lattice building: Strengths and Weaknesses
نویسندگان
چکیده
In many real world applications designers tend towards building classes of objects such as concepts chunks and clusters according to some similarity criteria In this paper we rst compare two approaches to clustering the Galois lattice approach and a similarity based clustering approach Then we sketch the possible ways each approach can bene t from the other in re ning the process of building a hierarchy of classes out of a set of instances
منابع مشابه
A Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach
In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملUniversal Health Coverage in Iran: A Review of Strengths, Weaknesses, Opportunities, and Threats
Background: Universal health coverage (UHC) aims to provide access to basic health services with no financial constraints. In Iran, the major challenges to the implementation of the UHC plan include aggregation and augmentation of resources, something which could threaten the dimension of population coverage and health service delivery. Therefore, this study reviews the strengths and weaknesses...
متن کاملIncremental Concept Formation Algorithms Based on Galois (Concept) Lattices
The Galois (or concept) lattice produced from a binary relation has been proved useful for many applications. Building the Galois lattice can be considered as a conceptual clustering method since it results in a concept hierarchy. This article presents incremental algorithms for updating the Galois lattice and corresponding graph, resulting in an incremental concept formation method. Different ...
متن کاملCooperative clustering for software modularization
Clustering is a useful technique to group data entities. Many different algorithms have been proposed for software clustering. To combine the strengths of various algorithms, researchers have suggested the use of Consensus Based Techniques (CBTs), where more than one actors (e.g. algorithms) work together to achieve a common goal. Although the use of CBTs has been explored in various discipline...
متن کامل